Secure Multi-Party Computation (Excerpts of Chapter 2)

نویسنده

  • Sandro Coretti
چکیده

3 Secure Multi-Party Computation 2 3.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 3.1.1 Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.1.2 Security Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 Passively Secure Multi-Party Computation . . . . . . . . . . . . . . . . . . . . . . 3 3.3 Actively Secure Multi-Party Computation . . . . . . . . . . . . . . . . . . . . . . . 5 3.3.1 Basic Idea . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.3.2 Generic Actively Secure MPC . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.3.3 Cryptographic Security . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.3.4 Information-Theoretic Security . . . . . . . . . . . . . . . . . . . . . . . . . 7

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unconditionally Secure Multi-party Computation from Weak Primitives

Let us assume that old friends meet again, after a long time. Both have become millionaires since that last time they met would like to find out who has been more successful in making money. However, they don't want the other to find out how much they earn, they both only want to get to know one bit of information. This problem is an example of secure multi-party computation, which has been int...

متن کامل

Second Summary Report on Multiparty Protocols Second Summary Report on Multiparty Protocols

Project co-funded by the European Commission within the 6th Framework Programme Dissemination Level PU Public X PP Restricted to other programme participants (including the Commission services) RE Restricted to a group specified by the consortium (including the Commission services) CO Confidential, only for members of the consortium (including the Commission services) The information in this do...

متن کامل

Practical and Deployable Secure Multi-Party Computation

Practical and Deployable Secure Multi-Party Computation

متن کامل

Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation

Secure sum computation of private data inputs is an important component of Secure Multi-party Computation (SMC).In this paper we provide a protocol to compute the sum of individual data inputs with zero probability of data leakage. In our proposed protocol we break input of each party into number of segments and change the arrangement of the parties such that in each round of the computation th...

متن کامل

Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities

In secure multi-party computation, a reactive functionality is one which maintains persistent state, takes inputs, and gives outputs over many rounds of interaction with its parties. Reactive functionalities are fundamental and model many interesting and natural cryptographic tasks; yet their security properties are not nearly as well-understood as in the non-reactive case (known as secure func...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011